A new geometric algorithm for the maximum density segment problem
نویسندگان
چکیده
The maximum segment density problem is this: Given a sequence of pairs (ai, wi), i = 1, 2, . . . , n, with wi > 0, and another pair of numbers L ≤ U , we have to find a subsequence ai, ai+1, . . . , aj whose density (ai + ai+1 + . . .+ aj)/(wi +wi+1 + . . .+wj) is maximum under the constraint that L ≤ wi + wi+1 + . . . + wj ≤ U . A principal motivation for studying this problem is its application to DNA sequence analyis in Computational Biology, particularly in the determination of the percentage of CG contents in a DNA sequence.
منابع مشابه
Algorithms for Problems on Maximum Density Segment
Let A be a sequence of n ordered pairs of real numbers (ai, li) (i = 1, . . . , n) with li > 0, and L and U be two positive real numbers with 0 < L U . A segment, denoted by A[i, j], 1 i j n, of A is a consecutive subsequence of A between the indices i and j (i and j included). The length l[i, j], sum s[i, j] and density d[i, j] of a segment A[i, j] are l[i, j] = ∑j t=i lt, s[i, j] = ∑j t=i at ...
متن کاملمدلسازی صفحهای محیطهای داخلی با استفاده از تصاویر RGB-D
In robotic applications and especially 3D map generation of indoor environments, analyzing RGB-D images have become a key problem. The mapping problem is one of the most important problems in creating autonomous mobile robots. Autonomous mobile robots are used in mine excavation, rescue missions in collapsed buildings and even planets’ exploration. Furthermore, indoor mapping is beneficial in f...
متن کاملPosynomial geometric programming problem subject to max–product fuzzy relation equations
In this article, we study a class of posynomial geometric programming problem (PGPF), with the purpose of minimizing a posynomial subject to fuzzy relational equations with max–product composition. With the help of auxiliary variables, it is converted convert the PGPF into an equivalent programming problem whose objective function is a non-decreasing function with an auxiliary variable. Some pr...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملPower Normal-Geometric Distribution: Model, Properties and Applications
In this paper, we introduce a new skewed distribution of which normal and power normal distributions are two special cases. This distribution is obtained by taking geometric maximum of independent identically distributed power normal random variables. We call this distribution as the power normal--geometric distribution. Some mathematical properties of the new distribution are presented. Maximu...
متن کامل